Hamiltonicity of edge chromatic critical graphs
نویسندگان
چکیده
منابع مشابه
Edge Chromatic 5-Critical Graphs
In this paper, we study the structure of 5-critical graphs in terms of their size. In particular, we have obtained bounds for the number of major vertices in several classes of 5-critical graphs, that are stronger than the existing bounds.
متن کاملA Class of Edge Critical 4-Chromatic Graphs
We consider several constructions of edge critical 4-chromatic graphs which can be written as the union of a bipartite graph and a matching. In particular we construct such a graph G with each of the following properties: G can be contracted to a given critical 4-chromatic graph; for each n;,: 7, G has n vertices and three matching edges (it is also 8n ) shown that such graphs must have at leas...
متن کاملRemarks on the size of critical edge-chromatic graphs
We give new lower bounds for the size of A-critical edge-chromatic graphs when 6~<A ~<21. 1. I n t r o d u c t i o n All graphs we consider are undirected and have neither loops nor multiple edges. We denote the vertex set of a graph G by V(G) and the edge set by E(G). The order of G is I V(G)I and the size of G is IE(G)I. We denote the degree of a vertex v in G by de(v) and the maximum degree ...
متن کاملCharacterization of some b-chromatic edge critical graphs
A b-coloring is a proper coloring of the vertices of a graph such that each color class has a vertex that is adjacent to a vertex of every other color. The b-chromatic number b(G) of a graph G is the largest k such that G admits a b-coloring with k colors. A graph G is b-chromatic edge critical if for any edge e of G, the b-chromatic number of G − e is less than the b-chromatic number of G. We ...
متن کاملOn the independence number of edge chromatic critical graphs
In 1968, Vizing conjectured that for any edge chromatic critical graph G = (V,E) with maximum degree ∆ and independence number α(G), α(G) ≤ |V | 2 . It is known that α(G) < 3∆−2 5∆−2 |V |. In this paper we improve this bound when ∆ ≥ 4. Our precise result depends on the number n2 of 2-vertices in G, but in particular we prove that α(G) ≤ 3∆−3 5∆−3 |V | when ∆ ≥ 5 and n2 ≤ 2(∆− 1).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.07.013